Power domination on triangular grids with triangular and hexagonal shape
نویسندگان
چکیده
منابع مشابه
Power Domination on Triangular Grids
The concept of power domination emerged from the problem of monitoring electrical systems. Given a graph G and a set S ⊆ V (G), a set M of monitored vertices is built as follows: at first, M contains only the vertices of S and their direct neighbors, and then each time a vertex in M has exactly one neighbor not in M , this neighbor is added to M . The power domination number of a graph G is the...
متن کاملFirefighting on square, hexagonal, and triangular grids
In this paper, we consider the firefighter problem on a graph G = (V,E) that is either finite or infinite. Suppose that a fire breaks out at a given vertex v ∈ V . In each subsequent time unit, a firefighter protects one vertex which is not yet on fire, and then the fire spreads to all unprotected neighbors of the vertices on fire. The objective of the firefighter is to save as many vertices as...
متن کاملCutwidth of triangular grids
When the vertices of an n-vertex graph G are numbered by the integers 1 through n, the length of an edge is the difference between the numbers on its endpoints. Two edges overlap if the larger of their lower numbers is less than the smaller of their upper numbers. The bandwidth of G is the minimum, over all numberings, of the maximum length of an edge. The cutwidth of G is the minimum, over all...
متن کاملTriangular and Hexagonal Tile Self-Assembly Systems Triangular and Hexagonal Tile Self-Assembly Systems
We discuss theoretical aspects of the self-assembly of triangular tiles, in particular, right triangular tiles and equilateral triangular tiles, and the self-assembly of hexagonal tiles. Contrary to intuition, we show that triangular tile assembly systems and square tile assembly systems cannot be simulated by each other in a non-trivial way. More precisely, there exists a square tile assembly ...
متن کاملQuasiperfect domination in triangular lattices
A vertex subset S of a graph G is a perfect (resp. quasiperfect) dominating set in G if each vertex v of G \ S is adjacent to only one vertex (dv ∈ {1, 2} vertices) of S. Perfect and quasiperfect dominating sets in the regular tessellation graph of Schläfli symbol {3, 6} and in its toroidal quotients are investigated, yielding the classification of their perfect dominating sets and most of thei...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Optimization
سال: 2020
ISSN: 1382-6905,1573-2886
DOI: 10.1007/s10878-020-00587-z